Morphic Computing
نویسنده
چکیده
In this paper, we introduce a new type of computation called “Morphic Computing”. Morphic Computing is based on Field Theory and more specifically Morphic Fields. Morphic Fields were first introduced by Rupert Sheldrake [1981] from his hypothesis of formative causation that made use of the older notion of Morphogenetic Fields. Rupert Sheldrake [1981] developed his famous theory, Morphic Resonance, on the basis of the work by French philosopher Henri Bergson. Morphic Fields and its subset Morphogenetic Fields have been at the center of controversy for many years in mainstream science and the hypothesis is not accepted by some scientists who consider it a pseudoscience. We claim that Morphic Computing is a natural extension of Holographic Computation, Quantum Computation, Soft Computing, and DNA Computing. All natural computations bonded by the Turing Machine can be formalised and extended by our new type of computation model – Morphic Computing. In this paper, we introduce the basis for this new computing paradigm and its extensions such as Quantum Logic and Entanglement in Morphic Computing, Morphic Systems and Morphic System of Systems (M-SOS). Its applications to the field of computation by words as an example of the Morphic Computing, Morphogenetic Fields in neural network and Morphic Computing, Morphic Fields concepts and Web search, and agents and fuzzy in Morphic Computing will also be discussed.
منابع مشابه
Morphic Computing: Morphic Systems and Morphic System of Systems (m-sos)
Morphic Computing is based on Field Theory [14-16] and more specifically Morphic Fields. Morphic Fields were first introduced by [18] from his hypothesis of formative causation that made use of the older notion of Morphogenetic Fields. [18] developed his famous theory, Morphic Resonance, on the basis of the work by French philosopher Henri Bergson. Morphic Computingis based on Field Theory and ...
متن کاملThe Quasi-morphic Property of Group
A group is called morphic if for each normal endomorphism α in end(G),there exists β such that ker(α)= Gβ and Gα= ker(β). In this paper, we consider the case that there exist normal endomorphisms β and γ such that ker(α)= Gβ and Gα = ker(γ). We call G quasi-morphic, if this happens for any normal endomorphism α in end(G). We get the following results: G is quasi-morphic if and only if, for any ...
متن کاملGeneralizations of Morphic Group Rings
An element a in a ring R is called left morphic if there exists b ∈ R such that 1R(a)= Rb and 1R(b)= Ra. R is called left morphic if every element ofR is left morphic. An element a in a ring R is called left π-morphic (resp., left G-morphic) if there exists a positive integer n such that an (resp., an with an = 0) is left morphic. R is called left π-morphic (resp., left G-morphic) if every elem...
متن کاملA Taxonomy of Morphic Sequences
In this note we classify sequences according to whether they are morphic, pure morphic, uniform morphic, pure uniform morphic, primitive morphic, or pure primitive morphic, and for each possibility we either give an example or prove that no example is possible.
متن کاملWatson-Crick Conjugate and Commutative Words
This paper is a theoretical study of notions in combinatorics of words motivated by information being encoded as DNA strands in DNA computing. We generalize the classical notions of conjugacy and commutativity of words to incorporate the notion of an involution function, a formalization of the Watson-Crick complementarity of DNA single-strands. We define and study properties of Watson-Crick con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Appl. Soft Comput.
دوره 8 شماره
صفحات -
تاریخ انتشار 2007